HICAP: Hierarchical Clustering with Pattern Preservation
نویسندگان
چکیده
منابع مشابه
HICAP: An Interactive Case-Based Planning Architecture
This paper describes HICAP, a general purpose planning architecture that we have developed and applied to assist military commanders and their sta with planning NEOs (Noncombatant Evacuation Operations). HICAP integrates a hierarchical task editor, HTE, with a conversational casebased planner, NaCoDAE/HTN. In this application, HTE maintains an agenda of tactical planning tasks that, according t...
متن کاملUsing Guidelines to Constrain Interactive Case-Based HTN Planning
This paper describes HICAP, a general-purpose, interactive case-based plan authoring architecture that can be applied to decision support tasks to yield a hierarchical course of action. It integrates a hierarchical task editor with a conversational case-based planner. HICAP maintains both a task hierarchy representing guidelines that constrain the nal plan and the hierarchical social organizati...
متن کاملHICAP: An Interactive Case-Based Planning Architecture and its Application to Noncombatant Evacuation Operations
This paper describes HICAP (Hierarchical Interactive Case-based Architecture for Planning), a general purpose planning architecture that we have developed and applied to assist military commanders and their staa with planning NEOs (Noncom-batant Evacuation Operations). HICAP integrates a hierarchical task editor, HTE, with a conversational case-based planning tool, NaCoDAE/HTN. In this applicat...
متن کاملAssessment of the Performance of Clustering Algorithms in the Extraction of Similar Trajectories
In recent years, the tremendous and increasing growth of spatial trajectory data and the necessity of processing and extraction of useful information and meaningful patterns have led to the fact that many researchers have been attracted to the field of spatio-temporal trajectory clustering. The process and analysis of these trajectories have resulted in the extraction of useful information whic...
متن کاملGraph Clustering by Hierarchical Singular Value Decomposition with Selectable Range for Number of Clusters Members
Graphs have so many applications in real world problems. When we deal with huge volume of data, analyzing data is difficult or sometimes impossible. In big data problems, clustering data is a useful tool for data analysis. Singular value decomposition(SVD) is one of the best algorithms for clustering graph but we do not have any choice to select the number of clusters and the number of members ...
متن کامل